On Generalizations of the Stirling Number Triangles
نویسنده
چکیده
Sequences of generalized Stirling numbers of both kinds are introduced. These sequences of triangles (i.e. infinite-dimensional lower triangular matrices) of numbers will be denoted by S2(k;n,m) and S1(k;n,m) with k ∈ Z. The original Stirling number triangles of the second and first kind arise when k = 1. S2(2;n,m) is identical with the unsigned S1(2;n,m) triangle, called S1p(2;n,m), which also represents the triangle of signless Lah numbers. Certain associated number triangles, denoted by s2(k;n,m) and s1(k;n,m), are also defined. Both s2(2;n,m) and s1(2;n + 1,m + 1) form Pascal’s triangle, and s2(−1, n,m) turns out to be Catalan’s triangle. Generating functions are given for the columns of these triangles. Each S2(k) and S1(k) matrix is an example of a Jabotinsky matrix. The generating functions for the rows of these triangular arrays therefore constitute exponential convolution polynomials. The sequences of the row sums of these triangles are also considered. These triangles are related to the problem of obtaining finite transformations from infinitesimal ones generated by x d dx , for k ∈ Z. AMS MSC numbers: 11B37, 11B68, 11B83, 11C08, 15A36 1 Overview Stirling’s numbers of the second kind (also called subset numbers), and denoted by S2(n,m) (or {
منابع مشابه
Generalized Stirling Numbers and Hyper-Sums of Powers of Binomials Coefficients
We work with a generalization of Stirling numbers of the second kind related to the boson normal ordering problem (P. Blasiak et al.). We show that these numbers appear as part of the coefficients of expressions in which certain sequences of products of binomials, together with their partial sums, are written as linear combinations of some other binomials. We show that the number arrays formed ...
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملGenerating Functions for Extended Stirling Numbers of the First Kind
In this paper we extend the definition of Stirling numbers of the first kind by way of a special multiset. This results in a family of number triangles for which we show how to obtain ordinary generating functions for the rows and exponential generating functions for the columns. The latter are derived via a recursive process. We also indicate how to obtain formulas, in terms of factorials, gen...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملOn a Number Pyramid Related to the Binomial, Deleham, Eulerian, MacMahon and Stirling number triangles
We study a particular number pyramid bn,k,l that relates the binomial, Deleham, Eulerian, MacMahon-type and Stirling number triangles. The numbers bn,k,l are generated by a function Bc(x, y, t), c ∈ C, that appears in the calculation of derivatives of a class of functions whose derivatives can be expressed as polynomials in the function itself or a related function. Based on the properties of t...
متن کامل